three steps of the method are, first, genetic algorithm is adopted in the whole planning area to hunt the possible traverse sequence of the substations; second, the least weight match algorithm in graph theory is adopted to optimize the tie lines between each substation and its neighbors according to the traverse sequence determined in the first step; finally, the scheme which has the least cost of investment in tie lines will be taken as the ultimate scheme 第一層優(yōu)化是在整個規(guī)劃區(qū)域內(nèi),應(yīng)用遺傳算法搜索可能的變電站的遍歷順序;第二層優(yōu)化是按照第一層優(yōu)化確定的遍歷順序,應(yīng)用綱絡(luò)圖論中的最小權(quán)匹配算法分別對每一個變電站與其相鄰站之間的聯(lián)絡(luò)線進(jìn)行優(yōu)化。